polygon covering造句
例句與造句
- A polygon covering problem is a special case of the set cover problem.
- In general, the problem of finding a smallest set covering is NP-complete, but for special classes of polygons, a smallest polygon covering can be found in polynomial time.
- It's difficult to find polygon covering in a sentence. 用polygon covering造句挺難的